Parsing Incomplete Sentences Revisited
نویسندگان
چکیده
We describe a context-free parsing algorithm to deal with incomplete sentences, including unknown parts of unknown length. It produces a finite shared-forest compiling all parses, often infinite in number, that could account for both the error and the missing parts. In contrast to previous works, we derive profit from a finer dynamic programming construction, leading to an improved computational behavior. We also introduce a deductive construction, which has the advantage of simplifying the task of description.
منابع مشابه
Parsing incomplete sentences
An efficient context-free parsing algorithm is presented that can parse sentences with unknown parts of unknown length. It produces in finite form all possible parses (often infinite in number) that could account for the missing parts. The algorithm is a variation on the construction due to Earley. However, its presentation is such that it can readily be adapted to any chart parsing schema (top...
متن کاملAn improved joint model: POS tagging and dependency parsing
Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...
متن کاملThe use of thematic role information in parsing: Syntactic processing autonomy revisited
Two eye-movement experiments examined the processing of sentences containing reduced relative constructions. In the first experiment, animacy of the sentential subject, structural ambiguity, and parafoveal preview of syntactically disambiguating material were manipulated. Evidence of disruption was found in temporarily ambiguous sentences, regardless of animacy or preview. In the second experim...
متن کاملتأثیر ساخت‌واژه‌ها در تجزیه وابستگی زبان فارسی
Data-driven systems can be adapted to different languages and domains easily. Using this trend in dependency parsing was lead to introduce data-driven approaches. Existence of appreciate corpora that contain sentences and theirs associated dependency trees are the only pre-requirement in data-driven approaches. Despite obtaining high accurate results for dependency parsing task in English langu...
متن کاملبرچسبزنی خودکار نقش‌های معنایی در جملات فارسی به کمک درخت‌های وابستگی
Automatic identification of words with semantic roles (such as Agent, Patient, Source, etc.) in sentences and attaching correct semantic roles to them, may lead to improvement in many natural language processing tasks including information extraction, question answering, text summarization and machine translation. Semantic role labeling systems usually take advantage of syntactic parsing and th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004